A geometric constraint over k-dimensional objects and shapes subject to business rules

This report presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem

Constrained decision diagrams

Proceedings of the National Conference on Artificial Intelligence1366-371PNAI

Maintaining generalized arc consistency on Ad-hoc n-ary boolean constraints

Frontiers in Artificial Intelligence and Applications14178-8

An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

10.1007/s10601-009-9087-yConstraints152265-304CNST

Ad-hoc global constraints for life

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3709 LNCS182-19

Search space reduction and russian doll search

Proceedings of the National Conference on Artificial Intelligence1179-184PNAI

Space-time tradeoffs for the regular constraint

10.1007/978-3-642-33558-7_18Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)7514 LNCS223-23

A refutation approach to neighborhood interchangeability in CSPs

10.1007/978-3-540-89378-3_10Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)5360 LNAI93-10

Maintaining generalized arc consistency on ad hoc r-ary constraints

10.1007/978-3-540-85958-1_34Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)5202 LNCS509-52